Chaos Games " for Iterated Function Systems withGrey Level

Two random iteration algorithms or \chaos games" for Iterated Function Systems on function spaces, namely IFS with grey level maps (IFSM), are described. The rst algorithm can be interpreted as a \chaos game in code space" and is guaranteed to work only in the case of nonoverlapping IFS maps. In the second algorithm, applicable to IFSM with overlapping IFS maps but aane grey level maps, the (normalized) IFSM attractor function u serves as the density for an invariant measure of an IFS with probabilities with condensation measure. As such, approximations to the attractor function of the IFSM are yielded by visitation histograms, as in the case of IFS with probabilities on measure spaces. Some computer results illustrating the convergence of this chaos game for a simple overlapping IFSM on 0,1] are also presented.